Super-edge-graceful labelings of multi-level wheel graphs, fan graphs and actinia graphs
نویسندگان
چکیده
graceful labeling of G. Such sets P and Q are called the vertex values set and edge labels set of G, respectively. The notions of super-edge-graceful graphs and edge-graceful graphs are different. Mitchem and Simoson [6] showed that the step graph C2 6 is super-edge-graceful but not edge-graceful. Shiu [7] showed that the complete graph K4 is edge-graceful but not super-edge-graceful. Mitchem and Simoson [6] showed that
منابع مشابه
Graceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملSuper-edge-graceful labelings of some cubic graphs
The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994. However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.
متن کاملThe place of super edge-magic labelings among other classes of labelings
A (p; q)-graph G is edge-magic if there exists a bijective function f :V (G)∪E(G)→{1; 2; : : : ; p + q} such that f(u) + f(v) + f(uv)= k is a constant, called the valence of f, for any edge uv of G. Moreover, G is said to be super edge-magic if f(V (G))= {1; 2; : : : ; p}. In this paper, we present some necessary conditions for a graph to be super edge-magic. By means of these, we study the sup...
متن کامل